Reformulating CSPs for Scalability with Application to Geospatial Reasoning
نویسندگان
چکیده
ion & Reformulation • Original formulation • Reformulated formulation Original problem Reformulated problem Reformulation technique The reformulation may be an approximation • Original query • Reformulated query Original space Reformulated space Φ(S l ti (P )) Solutions(Pr) o u ons o Solutions(Po) Constraint Systems Laboratory 10/1/2007 4 CP 2007 Issue: finding Ken’s house Google Maps Yahoo Maps
منابع مشابه
Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. Several consistency algorithms have exponential complexity in the CSP’s arity, others only work on low
متن کاملReformulating the Dual Graphs of CSPs to Improve the Performance of Relational Neighborhood Inverse Consistency
Freuder and Elfe (1996) introduced Neighborhood Inverse Consistency (NIC) as a new local consistency property for binary Constraint Satisfaction Problems (CSPs). Two advantages of the algorithm for enforcing NIC is that it automatically adapts its filtering power to the local connectivity of the network and has insignificant space overhead. However, studies on binary CSPs have shown that enforc...
متن کاملReformulating Propositional Satissability as Constraint Satisfaction
We study how propositional satissability (SAT) problems can be reformulated as constraint satisfaction problems (CSPs). We analyse four diierent mappings of SAT problems into CSPs. For each mapping , we compare theoretically the performance of systematic algorithms like FC and MAC applied to the encoding against the Davis-Putnam procedure applied to the original SAT problem. We also compare loc...
متن کاملTemporal CSPs
Reasoning with temporal constraints has been a hot research topic for the last twenty years. The importance of this topic has been recognized in many areas of Computer Science and Artificial Intelligence e.g., planning [4], scheduling [23], natural language understanding [91], knowledge representation [79], spatio-temporal databases and geographical information systems [62], constraint database...
متن کاملReformulating Constraint Satisfaction Problems to Improve Scalability
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in practice. Abstraction and reformulation techniques are often sought to overcome the complexity barrier. In this paper we introduce four reformulation techniques that operate on the various components of a Constraint Satisfaction Problem (CSP) in order to ...
متن کامل